Tekstens tab

Tab 12

Tab 11

Tab 5

The Pull-Tab Transformation

We present a new approach to the execution of functional logic programs. Our approach relies on definitional trees for the deterministic portions of a computation and on a graph transformation, called pull-tab, for the non-deterministic portions. This transformation moves, one level at a time, non-deterministic choices towards the root of the graph representing the state of a computation. With ...

Saving lives: who picks up the tab?